Mechanized Semantics of Simple Imperative Programming Constructs
نویسندگان
چکیده
In this paper a uniform formalization in PVS of various kinds of semantics of imper ative programming language constructs is presented Based on a comprehensive de velopment of xed point theory the denotational semantics of elementary constructs of imperative programming languages are de ned as state transformers These state transformers induce corresponding predicate transformers providing a means to for mally derive both a weakest liberal precondition semantics and an axiomatic semantics in the style of Hoare Moreover algebraic laws as used in re nement calculus proofs are validated at the level of predicate transformers Simple reformulations of the state transformer semantics yield both a continuation style semantics and rules similar to those used in Structural Operational Semantics This formalization provides the foundations on which formal speci cation of program ming languages and mechanical veri cation of compilation steps are carried out within the Veri x project This research has been funded in part by the Deutsche Forschungsgemeinschaft DFG under project Veri x
منابع مشابه
Mechanizing Domain Theory
We describe an encoding of major parts of domain theory and xed-point theory in the Pvs extension of the simply-typed-calculus; these formaliza-tions comprise the encoding of mathematical structures like complete partial orders (domains), domain constructions, the Knaster-Tarski xed-point theorem for mono-tonic functions, and variations of xed-point induction. Altogether, these encodings form a...
متن کاملStructural operational semantics through context-dependent behaviour
We present an operational semantics for an imperative language with concurrency and procedures. The approach is novel because we expose the building block operations – variable assignment and condition checking – in the labels on the transitions; these form the context-dependent behaviour of a program. Using this style results in two main advantages over existing formalisms for imperative progr...
متن کاملPredicate transformer semantics of a higher-order imperative language with record subtyping
Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a higher order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible speciication constructs, for a calculus of reenement. Procedures may have global variables, subject to ...
متن کاملControl Constructs in a Completely Visual Imperative Programming Language University of Colorado at Boulder Control Constructs in a Completely Visual Imperative Programming Language
Visual representations of programs can facilitate program understanding by presenting aspects of programs using explicit and intuitive representations. We have designed a completely visual static and dynamic representation of an imperative programming language. Because our representation of control is completely visual, programmers of this language can understand the static and dynamic semantic...
متن کاملMechanized semantics - with applications to program proof and compiler verification
The semantics of a programming language describe mathematically the meaning of programs written in this language. An example of use of semantics is to define a programming language with much greater precision than standard language specifications written in English. (See for example the definition of Standard ML [35].) In turn, semantics enable us to formally verify some programs, proving that ...
متن کامل